79 research outputs found
Self-Stabilizing Token Distribution with Constant-Space for Trees
Self-stabilizing and silent distributed algorithms for token distribution in rooted tree networks are given. Initially, each process of a graph holds at most l tokens. Our goal is to distribute the tokens in the whole network so that every process holds exactly k tokens. In the initial configuration, the total number of tokens in the network may not be equal to nk where n is the number of processes in the network. The root process is given the ability to create a new token or remove a token from the network. We aim to minimize the convergence time, the number of token moves, and the space complexity. A self-stabilizing token distribution algorithm that converges within O(n l) asynchronous rounds and needs Theta(nh epsilon) redundant (or unnecessary) token moves is given, where epsilon = min(k,l-k) and h is the height of the tree network. Two novel ideas to reduce the number of redundant token moves are presented. One reduces the number of redundant token moves to O(nh) without any additional costs while the other reduces the number of redundant token moves to O(n), but increases the convergence time to O(nh l). All algorithms given have constant memory at each process and each link register
Self-stabilizing K-out-of-L exclusion on tree network
In this paper, we address the problem of K-out-of-L exclusion, a
generalization of the mutual exclusion problem, in which there are units
of a shared resource, and any process can request up to units
(). We propose the first deterministic self-stabilizing
distributed K-out-of-L exclusion protocol in message-passing systems for
asynchronous oriented tree networks which assumes bounded local memory for each
process.Comment: 15 page
Stabilizing Inter-Domain Routing in the Internet
This paper reports the first self-stabilizing Border Gateway Protocol (BGP). BGP is the standard inter-domain routing protocol in the Internet. Self-stabilization is a technique to tolerate arbitrary transient faults.
The routing instability in the Internet can occur due to errors in configuring the routing data structures, the routing policies, transient physical and data link problems, software bugs, and memory corruption. This instability can increase the network latency, slow down the convergence of the routing data structures, and can also cause the partitioning of networks. Most of the previous studies concentrated on routing policies to achieve the convergence of BGP while the oscillations due to transient faults were ignored.
The purpose of self-stabilizing BGP is to solve the routing instability problem when this instability results from transient failures. The selfstabilizing BGP presented here provides a way to detect and automatically recover from this type of faults. Our protocol is combined with an existing protocol to make it resilient to policy conflicts as well
Maximum Matching for Anonymous Trees with Constant Space per Process
We give a silent self-stabilizing protocol for computing a maximum matching in an anonymous network with a tree topology. The round complexity of our protocol is O(diam), where diam is the diameter of the network, and the step complexity is O(n*diam), where n is the number of processes in the network. The working space complexity is O(1) per process, although the output necessarily takes O(log(delta)) space per process, where delta is the degree of that process. To implement parent pointers in constant space, regardless of degree, we use the cyclic Abelian group Z_7
Ring Exploration with Oblivious Myopic Robots
The exploration problem in the discrete universe, using identical oblivious
asynchronous robots without direct communication, has been well investigated.
These robots have sensors that allow them to see their environment and move
accordingly. However, the previous work on this problem assume that robots have
an unlimited visibility, that is, they can see the position of all the other
robots. In this paper, we consider deterministic exploration in an anonymous,
unoriented ring using asynchronous, oblivious, and myopic robots. By myopic, we
mean that the robots have only a limited visibility. We study the computational
limits imposed by such robots and we show that under some conditions the
exploration problem can still be solved. We study the cases where the robots
visibility is limited to 1, 2, and 3 neighboring nodes, respectively.Comment: (2012
Explorer un anneau avec des robots amnésiques et myopes
International audienceNous nous intéressons au problème de l'exploration d'un anneau avec arrêt avec k robots mobiles, identiques, amnésiques, dotés de capteurs leur permettant de percevoir leur environnement, mais incapables de communiquer explicitement. Nous considérons que les robots sont myopes, c'est-à -dire qu'il ne peuvent pas voir au delà d'une certaine distance fixée f. Nous montrons que si f =1, l'exploration avec arrêt déterministe n'est possible que si le système est synchrone. De plus, nous apportons des solutions synchrones déterministes qui sont optimales en nombre de robots
Competitive Self-Stabilizing k-Clustering
A k-cluster of a graph is a connected non-empty subgraph C of radius at most k, i.e., all members of C are within distance k of a particular node of C, called the clusterhead of C. A k-clustering of a graph is a partitioning of the graph into distinct k-clusters. Finding a mini-mum cardinality k-clustering is known to be NP-hard. In this paper, we propose a silent self-stabilizing asynchronous distributed algorithm for con-structing a k-clustering of any connected network with unique IDs. Our algorithm stabilizes in O(n) rounds, using O(log n) space per process, where n is the number of processes. In the general case, our algorithm constructs O(nk) k-clusters. If the network is a Unit Disk Graph (UDG), then our algorithm is 7.2552k + O(1)-competitive, that is, the number of k-clusters constructed by the algorithm is at most 7.2552k + O(1) times the minimum possible number of k-clusters in any k-clustering of the same network. More generally, if the net-work is an Approximate Disk Graph (ADG) with approximation ratio λ, then our algorithm is 7.2552λ2k +O(λ)-competitive. Our solution is based on the self-stabilizing construction of a data structure called the MIS Tree, a spanning tree of the network whose processes at even levels form a maximal indepen-dent set of the network. The MIS tree construction is the time bottleneck of our k-clustering algorithm, as it takes Θ(n) rounds in the worst case, while the remainder of the algorithm takes O(D) rounds, where D is the diameter of the network. We would like to improve that time to be O(D), but we show that our distributed MIS tree construction is a P-complete problem
- …